ProofPeer - A Cloud-based Interactive Theorem Proving System

نویسنده

  • Steven Obua
چکیده

Probably the most popular ITP systems these days are Isabelle [4a] and Coq [5]. Isabelle is a descendant of Edinburgh LCF. Its declarative extension Isabelle/Isar [4b] has been heavily influenced by Mizar. Coq can be viewed as a descendant of the Automath system in that both systems are based on the Curry-Howard correspondence [6] (a proof is a program, the formula it proves is a type for the program). Coq is implemented in OCaml [7], which is a dialect of Standard ML [8] which is one of the results of the Edinburgh LCF project, therefore Coq has been heavily influenced by Edinburgh LCF as well. Recently Coq has also gained declarative features similar to those found in Mizar and Isabelle/Isar. Another ITP system is HOL-light, another Edinburgh LCF system which has a small and actually formally verified kernel [17].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Social Network Processes in the Isabelle and Coq Theorem Proving Communities

We identify the main actors in the Isabelle and Coq communities and describe how they affect and influence their peers. This work explores selected foundations of social networking analysis that we expect to be useful in the context of the ProofPeer project, which is developing a new model for interactive theorem proving based on collaboration and social interactions.

متن کامل

ProofScript: Proof Scripting for the Masses

The goal of the ProofPeer project is to make collaborative theorem proving a reality. An important part of our plan to make this happen is ProofScript, a language designed to be the main user interface of ProofPeer. Of foremost importance in the design of ProofScript is its fit within a collaborative theorem proving environment. By this we mean that it needs to fit into an environment where pee...

متن کامل

ProofPeer: Collaborative Theorem Proving

ProofPeer We define the concept of collaborative theorem proving and outline our plan to make it a reality. We believe that a successful implementation of collaborative theorem proving is a necessary prerequisite for the formal verification of large systems. 1 The Challenge In today's computerised and scientific era, making our claims indefeasible is more critical and more relevant than ever. W...

متن کامل

A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving

In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...

متن کامل

An Interactive Theorem Proving Assistant

This paper describes WinKE, an interactive proof assistant, which is based on the KE calculus. The software has been designed to serve as a tutoring system supporting the teaching of logic and theorem proving through KE.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1201.0540  شماره 

صفحات  -

تاریخ انتشار 2012